package Practice;

import java.util.Arrays;
import java.util.Scanner;

public class StupidMonkey {
    public static boolean isPrime(int x){
        if (x < 2) return false;
        if (x == 2) return true;
        int x1 = (int) Math.sqrt(x);
        for (int i = 2; i <= x1; i++) {
            if (x%i==0)
                return false;
        }
        return true;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        int[] num = new int[26];
        for (char i = 'a'; i <= 'z'; i++) {
            for (int j = 0; j < s.length(); j++) {
                char n = s.charAt(j);
                if (n == i){
                    num[i-'a'] += 1;
                }
            }
        }
        Arrays.sort(num);
        int x = 0;
        for (int k = 25; k > 0; k--) {
            if (num[k] != 0 && num[k-1] == 0){
                x = num[k];
            }
        }
        int count = num[25]-x;
        if (isPrime(count)){
            System.out.println("Lucky Word");
            System.out.println(count);
        }
        else {
            System.out.println("No Answer");
            System.out.println("0");
        }
    }
}
